Weil Descent Attacks
نویسنده
چکیده
This article is to appear as a chapter in Advances in Elliptic Curve Cryptography, edited by I. Blake, G. Seroussi and N. Smart, Cambridge University Press, 2004. It summarises the main aspects of the existing literature on Weil descent attacks and contains some new material on the GHS attack in even characteristic.
منابع مشابه
On Security of Superelliptic Curves Based Cryptosystems against GHS Weil Descent Attacks
The GHS Weil descent attack by Gaudry, Hess and Smart was originally proposed to elliptic curves over finite fields of characteristic two [11]. Among a number of extensions of this attack, Diem treated the cases of hyperelliptic curves over finite fields of arbitrary odd characteristics [4]. His results were partially extended to algebraic curves of which the function fields are cyclic Galois e...
متن کاملLast Fall Degree, HFE, and Weil Descent Attacks on ECDLP
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic assumptions. In this paper we introduce the noti...
متن کاملSolving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
We provide the first cryptographically interesting instance of the elliptic curve discrete logarithm problem which resists all previously known attacks, but which can be solved with modest computer resources using the Weil descent attack methodology of Frey. We report on our implementation of index-calculus methods for hyperelliptic curves over characteristic two finite fields, and discuss the ...
متن کاملOn the asymptotic effectiveness of Weil descent attacks
In this paper we investigate the asymptotic effectiveness of the GaudryHess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
متن کاملDescent Identities, Hessenberg Varieties, and the Weil Conjectures
We apply the Weil conjectures to the Hessenberg Varieties to obtain information about the combinatorics of descents in the symmetric group. Combining this with elementary linear algebra leads to elegant proofs of some identities from the theory of descents. 3
متن کامل